On permutation automorphism groups of q-ary Hamming codes
نویسنده
چکیده
It is established that for any q > 2 the permutation automorphism group of a q-ary Hamming code of length n = (q − 1)/(q− 1) is isomorphic to the unitriangular group UTm(q).
منابع مشابه
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the codes. We find a regular subgroup of the automorphism group that can be used for permutation decoding, or partial permutation decoding, for any information set.
متن کاملProjective two-weight codes with small parameters and their corresponding graphs
Let GF(q) be the n-dimensional vector space over the Galois field GF(q). The Hamming distance between two vectors of GF(q) is defined to be the number of coordinates in which they differ. A q-ary linear [n, k, d; q]-code is a k-dimensional linear subspace of GF(q) with minimum distance d. Let n(k, d) denote the smallest value of n for which an [n, k, d]-code exists. An [n(k, d), k, d]-code is c...
متن کاملOn non-full-rank perfect codes over finite fields
The paper deals with the perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). We show that the orthogonal code to the q-ary non-full-rank 1-perfect code of length n = (q − 1)/(q − 1) is a q-ary constant-weight code with Hamming weight equals to qm−1 where m is any natural number not less than two. We derive necessary and sufficient conditions for...
متن کاملConstructions of transitive latin hypercubes
A set of vertices of the q-ary n-dimensional Hamming space is called a distance-2 MDS code if it has exactly one element in intersection with every line. By an isotopism we mean an isometric transformation of the Hamming space that independently permutes the symbols in every coordinate but does not change the coordinate order. A set M of vertices is called transitive if its automorphism group (...
متن کاملFull-Rank Perfect Codes over Finite Fields
In this paper, we propose a construction of fullrank q-ary 1-perfect codes over finite fields. This construction is a generalization of the Etzion and Vardy construction of fullrank binary 1-perfect codes (1994). Properties of i-components of q-ary Hamming codes are investigated and the construction of full-rank q-ary 1-perfect codes is based on these properties. The switching construction of 1...
متن کامل